Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases

نویسندگان

  • Fosca Giannotti
  • Dino Pedreschi
  • Carlo Zaniolo
چکیده

Non-deterministic extensions are needed in logic-based languages, such as First-Order relational languages and Datalog, to enhance their expressive power and support the eÆcient formulation of low-complexity problems and database queries. In this paper, we study the semantics and expressive power of the various non-deterministic constructs proposed in the past, including various versions of the choice operator and the witness operator. The paper develops a model-theoretic semantics, a xpoint semantics, and an operational semantics for these constructs, and characterizes their power of expressing deterministic and non-deterministic queries. The paper presents various soundness and completeness results and establishes an expressiveness hierarchy that correlates the various operators with each other, and with other constructs, such as negation and xpoint.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Determinism in Deductive Databases

This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with ...

متن کامل

Nonmonotonic Reasoning in Ldl ++

Deductive database systems have made major advances on eecient support for nonmonotonic reasoning. A rst generation of deductive database systems supported the notion of stratiication for programs with negation and set aggregates. Stratiication is simple to understand and eecient to implement but it is too restrictive; therefore, a second generation of systems seeks eecient support for more pow...

متن کامل

Key Constraints and Monotonic Aggregates in Deductive Databases

We extend the fixpoint and model-theoretic semantics of logic programs to include unique key constraints in derived relations. This extension increases the expressive power of Datalog programs, while preserving their declarative semantics and efficient implementation. The greater expressive power yields a simple characterization for the notion of set aggregates, including the identification of ...

متن کامل

Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases 1

This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undeened stable (L-stable) semantics for function-free disjunctive logic programs are considered, for which the expressiveness of queries based on possibility and certainty inference is dete...

متن کامل

Minimal founded semantics for disjunctive logic programs and deductive databases

In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 62  شماره 

صفحات  -

تاریخ انتشار 2001